tests = int(input())
for _ in range(tests):
n = input()
if n.count('0') == 0:
print("cyan")
continue
par = 0
sum = 0
for num in n.replace('0','',1):
sum += int(num)
if(int(num) % 2 == 0):
par += 1
if par == 0:
print("cyan")
continue
if sum % 3 != 0:
print("cyan")
continue
print("red")
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll gcd(ll a,ll b)
{
ll R;
while ((a % b) > 0)
{
R = a % b;
a = b;
b = R;
}
return b;
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// vector <bool>prim(100000000);
// for (ll i=2 ;i<100000 ;i++)
// {
// if (!prim[i])
// {
// ll k=2;
// while (k*i<=100000)
// {
// prim[k*i]=1;
// k++;
// }
// }
// }
int tc=1;
cin >> tc;
int kkkkk=tc;
while(tc--)
{
// cout <<kkkkk-tc<<"------->\n";
string s;
cin >> s;
int z=0,t=0;
int sum=0;
for (int i=0 ;i<s.size() ;i++)
{
sum+=s[i]-'0';
if (s[i]=='0')
z++;
else if((s[i]-'0')%2==0)
t=1;
}
if ((z && (t || z>1) && sum%3==0) || sum==0)
cout << "red\n";
else
cout << "cyan\n";
}
return 0;
}
437. Path Sum III | 436. Find Right Interval |
435. Non-overlapping Intervals | 406. Queue Reconstruction by Height |
380. Insert Delete GetRandom O(1) | 332. Reconstruct Itinerary |
368. Largest Divisible Subset | 377. Combination Sum IV |
322. Coin Change | 307. Range Sum Query - Mutable |
287. Find the Duplicate Number | 279. Perfect Squares |
275. H-Index II | 274. H-Index |
260. Single Number III | 240. Search a 2D Matrix II |
238. Product of Array Except Self | 229. Majority Element II |
222. Count Complete Tree Nodes | 215. Kth Largest Element in an Array |
198. House Robber | 153. Find Minimum in Rotated Sorted Array |
150. Evaluate Reverse Polish Notation | 144. Binary Tree Preorder Traversal |
137. Single Number II | 130. Surrounded Regions |
129. Sum Root to Leaf Numbers | 120. Triangle |
102. Binary Tree Level Order Traversal | 96. Unique Binary Search Trees |